A Novel Interconnection Network with Improved Network Cost Through Shuffle-Exchange Permutation Graph

نویسندگان

چکیده

The interconnection network represents an interconnected structure of processors that strongly determines the performance quality a parallel processing system. shuffle-exchange permutation (SEP) with three degrees has high fault tolerance and can be efficiently simulated through star, bubble-sort, pancake graphs. This study proposes new network: SEP (NSEP), which improves diameter reduces cost by adding one edge to network, presents its graph properties routing algorithms. NSEP degree connectivity four, demonstrated maximum Hamiltonian cycle. Furthermore, was seen improved 40% or more 20% more.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On The Shuffle-Exchange Permutation Network

The shuffle-exchange permutation network (SEPn) is a fixed degree Cayley graph which has been proposed as a basis for massively parallel systems. We propose a routing algorithm with an upper bound of (5/8)n + O(n), where n is the length of the permutation. (This improves on a (9/8)n routing algorithm described earlier [5].) Thus, the diameter of SEPn is at most (5/8) n 2 + O(n). We also show th...

متن کامل

The Multi-Directional Shuffle-Exchange Network: A Novel Topology for Regular Network Architectures

In this pape~ a novel class of network topologies known as the Multi-dimensional Shu@e-exchange Network (A4DSXN) is proposed. We show that the well-known de Bruijn graph and hypercube in fact both belong to the same class of graphs represented by MDSXN. The MDSXN is therefore the unification and generalization of the de Brutjn graph and hypercube. We show that members of MDSXN inherit the topol...

متن کامل

Square Interconnection Network for Data Permutation

In this paper a square cellular network for data permutation in a SIMD model is described. It has n=4 2–permuters only, and realizes an arbitrary permutation pattern in two passes. For this network a programming algorithm is provided with O(n) sequential time complexity. Due to its regular cellular structure the square network is suitable for VLSI implementation.

متن کامل

Hyper-Star Graph: A New Interconnection Network Improving the Network Cost of the Hypercube

In this paper, we introduce the hyper-star graph HS(n, k) as a new interconnection network, and discuss its properties such as faulttolerance, scalability, isomorphism, routing algorithm, and diameter. A hyper-star graph has merits when degree × diameter is used as a desirable quality measure of an interconnection network because it has a small degree and diameter. We also introduce a variation...

متن کامل

Improved Meta-Flattened Butterfly Multistage Interconnection Network

Parallel processing is efficient form of information processing which means to implement high performance computing systems. A communication network that links processors and memory modules determines the efficiency of these parallel systems. To provide the required connectivity and performance at reasonable cost, an interconnection network is used. Hence, multistage interconnection networks ar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronics

سال: 2021

ISSN: ['2079-9292']

DOI: https://doi.org/10.3390/electronics10080943